A New Method for Computing Asymptotic Results in Optimal Stopping Problems
نویسندگان
چکیده
In this paper, we present a novel method for computing the asymptotic values of both optimal threshold and probability success in sequences stopping problems. This method, based on resolution first-order linear differential equation, makes it possible to systematically obtain these many situations. As an example, address nine variants well-known secretary problem, including classical one, that appear literature subject, as well four other unpublished ones.
منابع مشابه
A New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملOptimal Stopping Problems
In the last lecture, we have analyzed the behavior of TD(λ) for approximating the costtogo function in autonomous systems. Recall that much of the analysis was based on the idea of sampling states according to their stationary distribution. This was done either explicitly, as was assumed in approximate value iteration, or implicitly through the simulation or observation of system trajectories...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملA New Learning Algorithm for Optimal Stopping
A linear programming formulation of the optimal stopping problem for Markov decision processes is approximated using linear function approximation. Using this formulation, a reinforcement learning scheme based on a primal-dual method and incorporating a sampling device called ‘split sampling’ is proposed and analyzed. An illustrative example from option pricing is also included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2022
ISSN: ['2180-4206', '0126-6705']
DOI: https://doi.org/10.1007/s40840-022-01436-4